Propagating N-Ary Rigid-Body Constraints
نویسندگان
چکیده
In this paper, we present an algorithm to propagate an n-ary constraint (with n greater than 2) specifying the relative positions of points in a three-dimensional rigid group. The variables to restrict are the positions (x, y, and z coordinates) of the points, and we assume the variable domains are cuboids, with the faces parallel to the coordinate axes. This algorithm is part of PSICO (Processing Structural Information with Constraint programming and Optimisation), a method we are developing to integrate experimental and theoretical data to solve protein structures [1,2]. We also present some preliminary results, and explain how this algorithm can be used to combine theoretical information such as secondary structure prediction or homology modelling with Nuclear Magnetic Resonance (NMR) data.
منابع مشابه
FUZZY ROUGH N-ARY SUBHYPERGROUPS
Fuzzy rough n-ary subhypergroups are introduced and characterized.
متن کاملNEW TYPES OF FUZZY n-ARY SUBHYPERGROUPS OF AN n-ARY HYPERGROUP
In this paper, the new notions of ``belongingness ($in_{gamma}$)"and ``quasi-coincidence ($q_delta$)" of a fuzzy point with a fuzzyset are introduced. By means of this new idea, the concept of$(alpha,beta)$-fuzzy $n$-ary subhypergroup of an $n$-aryhypergroup is given, where $alpha,betain{in_{gamma}, q_{delta},in_{gamma}wedge q_{delta}, ivq}$, andit is shown that, in 16 kinds of $(alpha,beta...
متن کاملApplication of fundamental relations on n-ary polygroups
The class of $n$-ary polygroups is a certain subclass of $n$-ary hypergroups, a generalization of D{"o}rnte $n$-arygroups and a generalization of polygroups. The$beta^*$-relation and the $gamma^*$-relation are the smallestequivalence relations on an $n$-ary polygroup $P$ such that$P/beta^*$ and $P/gamma^*$ are an $n$-ary group and acommutative $n$-ary group, respectively. We use the $beta^*$-...
متن کاملArc Consistency on n-ary Monotonic and Linear Constraints
Many problems and applications can be naturally modelled and solved using constraints with more than two variables Such n ary constraints in particular arithmetic constraints are provided by many nite domain constraint programming systems The best known worst case time complexity of existing algorithms GAC schema for enforcing arc consistency on general CSPs is O ed where d is the size of domai...
متن کامل